Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
نویسندگان
چکیده
منابع مشابه
Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks
Multiparty interactive coding allows a network of n parties to perform distributed computations when the communication channels suffer from noise. Previous results (Rajagopalan and Schulman, STOC ’94) obtained a multiparty interactive coding protocol, resilient to random noise, with a blowup of O(log(∆ + 1)) for networks whose topology has a maximal degree ∆. Vitally, the communication model in...
متن کاملSecure Multiparty Interactive Communication with Unknown Noise Rate
A group of n users want to run a distributed protocol π over a network where communication occurs via private point-to-point channels. Unfortunately, an adversary, who knows π, is able to maliciously flip bits on the channels. Can we efficiently simulate π in the presence of such an adversary? We show that this is possible, even when L, the number of bits sent in π, and T , the number of bits f...
متن کاملCoding for interactive communication
Let the input to a computation problem be split between two processors connected by a commu nication link and let an interactive protocol be known by which on any input the processors can solve the problem using no more than T transmissions of bits between them provided the channel is noiseless in each direction We study the following question if in fact the channel is noisy what is the e ect u...
متن کاملEfficiently Coding for Interactive Communication
In 1992, Schulman [11] proved a coding theorem for interactive communication and demonstrated that interactive communication protocols can be made robust to noise with only a constant slow-down (for a sufficiently small error rate) through a black-box reduction. However, this scheme is not computationally efficient: the running time to construct a good distance tree code (and perform encoding a...
متن کاملConstant communication complexity protocols for multiparty accumulative boolean functions
Generalizing a boolean function from Cleve and Buhrman [3], we consider the class of accumulative boolean functions of the form fB(X1, X2, . . . , Xm) = ⊕n i=1 tB(x 1 i x 2 i . . . x m i ), where Xj = (x j 1 , x 2 , . . . , xn), 1 ≤ j ≤ m and tB(x 1 i x 2 i . . . x m i ) = 1 for input m-tuples x 1 ix 2 i ...x m i ∈ B ⊆ A ⊆ {0, 1}, and 0, otherwise. Here the set A is the promise set for function...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2018
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3050218